Jm Partitions and a Ladder Based Model for the Basic Crystal

J un 2 00 9 Combinatorics of ( l , 0 ) - JM partitions , l - cores , the ladder crystal and the finite Hecke algebra

Partition models for the crystal of the basic U q ( ŝl n ) - module

For each n > 3, we construct an uncountable family of models of the crystal of the basic Uq(ŝln)-module. These models are all based on partitions, and include the usual n-regular and n-restricted models, as well as Berg’s ladder crystal, as special cases.

Wised Semi-Supervised Cluster Ensemble Selection: A New Framework for Selecting and Combing Multiple Partitions Based on Prior knowledge

The Wisdom of Crowds, an innovative theory described in social science, claims that the aggregate decisions made by a group will often be better than those of its individual members if the four fundamental criteria of this theory are satisfied. This theory used for in clustering problems. Previous researches showed that this theory can significantly increase the stability and performance of...

Function , and Their Crystal Theoretic Interpretation

In this paper we give an alternate combinatorial description of the " (ℓ, 0)-JM partitions " (see [4]) that are also ℓ-regular. Our main theorem is the equivalence of our combinatoric and the one introduced by James and Mathas ([7]). The condition of being an (ℓ, 0)-JM partition is fundamentally related to the hook lengths of the partition. The representation-theoretic significance of their com...

Wised Semi-Supervised Cluster Ensemble Selection: A New Framework for Selecting and Combing Multiple Partitions Based on Prior knowledge

The Wisdom of Crowds, an innovative theory described in social science, claims that the aggregate decisions made by a group will often be better than those of its individual members if the four fundamental criteria of this theory are satisfied. This theory used for in clustering problems. Previous researches showed that this theory can significantly increase the stability and performance of...